Optimal block iterative schemes for certain large, sparse, and nonsymmetric linear systems
نویسندگان
چکیده
منابع مشابه
Block Approximate Inverse Preconditioners for Sparse Nonsymmetric Linear Systems
Abstract. In this paper block approximate inverse preconditioners to solve sparse nonsymmetric linear systems with iterative Krylov subspace methods are studied. The computation of the preconditioners involves consecutive updates of variable rank of an initial and nonsingular matrix A0 and the application of the Sherman-MorrisonWoodbury formula to compute an approximate inverse decomposition of...
متن کاملResidual iterative schemes for large-scale nonsymmetric positive definite linear systems
A new iterative scheme that uses the residual vector as search direction is proposed and analyzed for solving large-scale nonsymmetric linear systems, whose matrix has a positive (or negative) definite symmetric part. It is closely related to Richardson’s method, although the stepsize and some other new features are inspired by the success of recently proposed residual methods for nonlinear sys...
متن کاملSolving Large Nonsymmetric Sparse Linear Systems Using MCSPARSE
In this paper, the methods and implementation techniques used for the nonsymmetric sparse linear system solver, MCSPARSE, on the Cedar system are described. A novel reordering scheme (H*) upon which the solver is based is presented. The tradeoffs discussed include stability and fill-in control, hierarchical parallelism, and load balancing. Experimental results demonstrating the effectiveness of...
متن کاملParallel iterative solution method for large sparse linear equation systems
Solving sparse systems of linear equations is at the heart of scientific computing. Large sparse systems often arise in science and engineering problems. One such problem we consider in this paper is the steadystate analysis of Continuous Time Markov Chains (CTMCs). CTMCs are a widely used formalism for the performance analysis of computer and communication systems. A large variety of useful pe...
متن کاملBlock and Seed Bicgstab Algorithms for Nonsymmetric Multiple Linear Systems
In this paper we give a block version of the BiCGSTAB algorithm for solving multiple linear systems using some algebraic orthogonalities. These orthogonalities allow us to deene a new procedure called PNB : Partial Near Breakdown procedure in order to stabilize the convergence of the block BiCGSTAB algorithm. We also introduce a seed version of the (block) BiCGSTAB algorithm. Finally, some nume...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1988
ISSN: 0024-3795
DOI: 10.1016/0024-3795(83)90142-8